Cyclic Cutwidth of the Mesh
نویسندگان
چکیده
The cutwidth problem is to nd a linear layout of a network so that the maximal number of cuts (cw) of a line separating consecutive vertices is minimized. A related and more natural problem is the cyclic cutwidth (ccw) when a circular layout is considered. The main question is to compare both measures cw and ccw for speciic networks, whether adding an edge to a path and forming a cycle reduces the cutwidth essentially. We prove exact values for the cyclic cutwidths of the 2-dimensional ordinary and cylindrical meshes Pm Pn and Pm Cn; respectively. Especially , if m n + 3; then ccw(Pm Pn) = cw(Pm Pn) = n + 1 and if n is even then ccw(Pn Pn) = n ? 1 and cw(Pn Pn) = n + 1 and if m 2; n 3; then ccw(Pm Cn) = minfm + 1; n + 2g:
منابع مشابه
The Linear and Cyclic Cutwidth of the Complete Bipartite Graph
We shall consider the problem of embedding the complete bipartite graph, Km,n, onto a linear and cyclic chassis in such a way as to minimize the cutwidth. The linear cutwidth of the complete bipartite graph is established and a partial solution to the cyclic cutwidth is presented. It is known that there is a paper in existance [3] that has established the linear cutwidth of the complete biparti...
متن کاملCutwidth of the Mesh of dary Trees
In this paper we show that the cutwidth of the mesh of d-ary trees MT(d; n) is of order (d n+1), which improves both upper and lower bounds of Barth 2], by a factor of d.
متن کاملCutwidth of the r-dimensional mesh of d-ary trees
We prove that the cutwidth of the r-dimensional mesh of d-ary trees is of order (d (r?1)n+1), which improves and generalizes the previous result of Barth 2]. Resum e Nous provons que la largeur de coupe de la grille r-dimensionall d'arbres d-naires est d'ordre (d (r?1)n+1), que ameliore et generalise le resultat de Barth 2].
متن کاملOn Bandwidth, Cutwidth, and Quotient Graphs
The bandwidth and the cutwidth are fundamental parameters which can give indications on the complexity of many problems described in terms of graphs. In this paper, we present a method for nding general upper bounds for the bandwidth and the cutwidth of a given graph from those of any of its quotient graphs. Moreover, general lower bounds are obtained by using vertex-and edge-bisection notions....
متن کاملCongestion and dilation, similarities and differences: A survey
We survey general results on congestion and dilation, and their special cases (cyclic) cutwidth and (cyclic) bandwidth, with the emphasis on the similarity and the duality of both parameters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999